Regular sequences and random walks in affine buildings
نویسندگان
چکیده
منابع مشابه
Regular sequences and random walks in affine buildings
— We define and characterise regular sequences in affine buildings, thereby giving the p-adic analogue of the fundamental work of Kaimanovich on regular sequences in symmetric spaces. As applications we prove limit theorems for random walks on affine buildings and their automorphism groups. Résumé. — On donne la définition et des caractérisations de suites régulières dans les immeubles affines....
متن کاملIsotropic Random Walks on Affine Buildings
Recently, Cartwright and Woess [5] provided a detailed analysis of isotropic random walks on the vertices of thick affine buildings of type Ãn. Their results generalise results of Sawyer [18] where homogeneous trees are studied (these are Ã1 buildings), and Lindlbauer and Voit [9], where Ã2 buildings are studied. In this paper we apply techniques of spherical harmonic analysis to prove a local ...
متن کاملMultiple Random Walks in Random Regular Graphs
We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random r-regular graph was studied in [6], where it was shown with high probability (whp), that for r ≥ 3 the cover time is asymptotic to θrn lnn, where θr = (r − 1)/(...
متن کاملRandom Walks on Regular and Irregular Graphs
For an undirected graph and an optimal cyclic list of all its vertices, the cyclic cover time is the expected time it takes a simple random walk to travel from vertex to vertex along the list, until it completes a full cycle. The main result of this paper is a characterization of the cyclic cover time in terms of simple and easy to compute graph properties. Namely, for any connected graph, the ...
متن کاملViral Processes by Random Walks on Random Regular Graphs
We study the SIR epidemic model with infections carried by k particles making independent random walks on a random regular graph. Here we assume k ≤ n , where n is the number of vertices in the random graph and is some sufficiently small constant. We give an edge-weighted graph reduction of the dynamics of the process that allows us to apply standard results of Erdős-Rényi random graphs on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’institut Fourier
سال: 2015
ISSN: 0373-0956,1777-5310
DOI: 10.5802/aif.2941